package DynamicProgramingSeries;

public class RobSolution_198 {
    public int rob(int[] nums) {
        // dp[i] = 偷第i个房子所能得到的最高金额
        int[] dp = new int[nums.length];

        if (nums.length == 1) {
            return nums[0];
        }

        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);

        for (int i = 2; i < nums.length; i++) {
            dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]);
        }

        return dp[nums.length - 1];
    }
}
